搜索资源列表
Cpp
- VRP问题蚁群算法的c++源码，很具有代表性-VRP problem of the ant colony algorithm c++ source code, it is a representative
matlab
- VRP问题的蚁群算法源码，很经典，很实用-Ant colony algorithm VRP source problem, it is a classic, it is practical
ANT
- 蚁群算法解决VRP问题的可行算法-Ant colony algorithm for solving practical VRP problems. . . . . . . . . . . . . . . . . .
Ant-colony-algorithm
- 程序试图对具有31个城市的VRP进行求解，已知的最优解为784.1-Program attempts to have 31 cities on the VRP is solved, the known optimal solution for the 784.1
ACO
- Ant Colony Optimization for VRP
VRP
- 自己编写的蚁群算法能够得到结果，最终结果可以得到最短路程-Write your own ant colony algorithm to get the results, the end result can be the shortest route
VRP
- 引入路径权重的自适应蚁群算法用于应急物资调度路径优化的Matlab代码 -The introduction of path weights adaptive ant colony algorithm for scheduling path of the emergency supplies optimized Matlab code
VRP
- 该程序是用C＋＋编写的蚁群算法程序，专门用来求解车辆路径问题（VRP）。-The program is in C++ ant colony algorithm written procedures, designed to solve the vehicle routing problem (VRP).
AntTSP
- 一种蚁群算法，主要关于VRP问题，可以计算最短路径，并且显示最佳路径-An ant colony, the main issue on the VRP, we can calculate the shortest path, and show the best path
VRP
- 解决车辆路径问题使用矩阵蚂蚁算法 车辆调度问题（Vehicle Routing Problem，VRP）是一个典 型的NP 难题，只有在需点数和路段数较少时才有可能寻求其 精确解，一般情况下，很难得到全局最优解或满意解-Matrix ant algorithm to solve the vehicle routing problem Matrix ant algorithm to solve the vehicle routing problem
vrp-ant
- 可以运行的多个蚁群算法，本人已经验证过，放心使用-You can run multiple ant colony algorithm, I have verified
VRP
- 蚁群算法，2-opt，解决车辆路径问题（vrp）的matlab代码，修正了原始代码忽略初始节点下一节点cost的问题，但是对某些测试数据集存在车辆数大于或小于的标准问题。-Ant colony algorithm ,2-opt, vehicle routing problem (vrp) matlab code, amended the original code ignores the initial node next node cost problems, but for some tes
vrp
- ：强大的蚁群算法matlab程序源代码，可以迅速求解vrp等np难问题。-Ant colony algorithm matlab powerful source code, you can quickly solve the difficult problem of np such vrp.-: Powerful ant colony algorithm matlab source code, you can quickly solve difficult problems vrp etc. n
ant-algorithms-of-vrp
- 采用蚁群算法能够解决31个城市的旅行商问题，相对于遗传算法，模拟退火算法和其他的算法，蚁群算法有其自身的优势-Ant colony algorithm to solve the traveling salesman problem 31 cities, with respect to genetic algorithms, simulated annealing algorithm and other algorithms, ant colony algorithm has its own ad
ant-algorithem-with-use-of-vb
- 此文件使用vb编程实现蚂蚁算法，从而用来解决车辆路径问题-solve vrp using ant algorithem
vrp
- 采用蚁群算法与节约算法结合的车辆路径问题，国际案例得出最优解，生成图片-By using ant colony algorithm and the combination of the vehicle routing problem, the optimal solution is obtained in the international case.
VRP
- 使用蚁群算法求解VRP程序的一个较好的程序，Matlab源代码，包含过程文件-Using ant colony algorithm to solve VRP program of one of the better, the Matlab source code, containing process files
ant-colony-algorithm
- 用于解决vrp问题的蚁群算法，已成功解决很多问题-The ant colony algorithm for solving VRP Problem has been successfully solved many problems
VRP
- 引入路径权重的自适应蚁群算法用于应急物资调度路径优化的Matlab编码-Adaptive ant colony algorithm with path weight for Matlab coding of emergency material scheduling
matlab_vrp(1)
- 首先实现一个ant蚂蚁类，用此蚂蚁类实现搜索。 算法按照tsp问题去解决，但是在最后计算路径的时候有区别。 比如有10个城市,城市1是配送站，蚂蚁搜索的得到的路径是1,3,5,9,4,10,2,6,8,7。 计算路径的时候把城市依次放入派送线路中, 每放入一个城市前，检查该城市放入后是否会超过车辆最大载重 如果没有超过就放入 如果超过，就重新开始一条派送路线 …… 直到最后一个城市放完 就会得到多条派送路线 这样处理比较简单可以把vrp问题转为tsp问题求解 但